An equivalent condition for a uniform space to be coverable
نویسندگان
چکیده
منابع مشابه
Illustrating an Error in “an Equivalent Condition for a Uniform Space to Be Coverable”
Berestovskii and Plaut introduced the concept of a coverable space [1] when developing their theory of generalized universal covering maps for uniform spaces. If a space is coverable and chain connected then it has a generalized universal covering map. Brodskiy, Dydak, LaBuz, and Mitra introduced the concept of a uniformly joinable space [2] when developing a theory of generalized uniform cover...
متن کاملar X iv : 0 70 7 . 36 08 v 2 [ m at h . G N ] 1 1 O ct 2 00 7 An equivalent condition for a uniform space to be coverable
We prove that an equivalent condition for a uniform space to be cov-erable is that the images of the natural projections in the fundamental inverse system are uniformly open in a certain sense. As corollaries we (1) obtain a concrete way to find covering entourage, (2) correct an error in [3], and (3) show that coverable is equivalent to chain connected and uniformly joinable in the sense of [5...
متن کاملA necessary condition for a Shearlet system to be a frame via admissibility
Necessary conditions for shearlet and cone-adapted shearlet systems to be frames are presented with respect to the admissibility condition of generators.
متن کاملA Necessary and Sufficient Condition for Graph Matching to be equivalent to Clique Search
This paper formulates a necessary and sufficient condition for a generic graph matching problem to be equivalent to the maximum vertex and edge weight clique problem in a derived association graph. The consequences of this results are threefold: first, the condition is general enough to cover a broad range of practical graph matching problems; second, a proof to establish equivalence between gr...
متن کاملAn efficient condition for a graph to be Hamiltonian
LetG= (V ,E) be a 2-connected simple graph and let dG(u, v) denote the distance between two vertices u, v in G. In this paper, it is proved: if the inequality dG(u) + dG(v) |V (G)| − 1 holds for each pair of vertices u and v with dG(u, v) = 2, then G is Hamiltonian, unless G belongs to an exceptional class of graphs. The latter class is described in this paper. Our result implies the theorem of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 2009
ISSN: 0166-8641
DOI: 10.1016/j.topol.2008.08.008